![]() ![]() ![]() | ![]() |
|
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Robert R. Snapp Zhen He , Byung Suk Lee , Robert R. Snapp: Self-tuning UDF Cost Modeling Using the Memory-Limited Quadtree. EDBT 2004 : 513-531 Byung Suk Lee , Terence Critchlow , Ghaleb Abdulla , Chuck Baldwin , Roy Kamimura , Ron Musick , Robert R. Snapp, Nu Ai Tang : The framework for approximate queries on simulation data. Inf. Sci. 157 : 3-20 (2003) Byung Suk Lee , Robert R. Snapp, Ron Musick , Terence Critchlow : Metadata models for ad hoc queries on terabyte-scale scientific simulations. J. Braz. Comp. Soc. 8 (1): 0-15 (2002) Byung Suk Lee , Robert R. Snapp, Ron Musick : Toward a Query Language on Simulation Mesh Data: An Object-oriented Approach. DASFAA 2001 : 242-249 Ghaleb Abdulla , Chuck Baldwin , Terence Critchlow , Roy Kamimura , Ida Lozares , Ron Musick , Nu Ai Tang , Byung Suk Lee , Robert R. Snapp: Approximate ad-hoc query engine for simulation data. JCDL 2001 : 255-256 Byung Suk Lee , Robert R. Snapp, Ron Musick , Terence Critchlow : Ad hoc Query Support for Very Large Scientific Data: the Metadata Approach. SBBD 2001 : 199-212 Robert R. Snapp, Tong Xu : Estimating the Bayes Risk from Sample Data. NIPS 1995 : 232-238 Demetri Psaltis , Robert R. Snapp, Santosh S. Venkatesh : On the finite sample performance of the nearest neighbor classifier. IEEE Transactions on Information Theory 40 (3): 820-837 (1994) Santosh S. Venkatesh , Robert R. Snapp, Demetri Psaltis : Bellman Strikes Again! The Growth Rate of Sample Complexity with Dimension for the Nearest Neighbor Classifier. COLT 1992 : 93-102 Robert R. Snapp, Demetri Psaltis , Santosh S. Venkatesh : Asymptotic Slowing Down of the Nearest-Neighbor Classifier. NIPS 1990 : 932-938 1 [ 6 ] [ 9 ] 2 [ 6 ] [ 9 ] 3 [ 5 ] [ 6 ] [ 8 ] [ 9 ] 4 [ 10 ] 5 [ 6 ] [ 9 ] 6 [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] 7 [ 6 ] 8 [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] 9 [ 1 ] [ 2 ] [ 3 ] 10 [ 6 ] [ 9 ] 11 [ 1 ] [ 2 ] [ 3 ] 12 [ 4 ] ![]() ©2005 Association for Computing Machinery |