Sciweavers

860 search results - page 83 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
TIT
2010
90views Education» more  TIT 2010»
13 years 2 months ago
Correcting limited-magnitude errors in the rank-modulation scheme
We study error-correcting codes for permutations under the infinity norm, motivated the rank-modulation scheme for flash memories. In this scheme, a set of n flash cells are combin...
Itzhak Tamo, Moshe Schwartz
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
14 years 1 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
COLT
2004
Springer
14 years 1 months ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
CGF
1998
98views more  CGF 1998»
13 years 7 months ago
An Enhanced Spring Model for Information Visualization
In this paper we present a new technique for visualizing multidimensional information. We describe objects of a higher dimensional information space as small closed free-form-surf...
Holger Theisel, Matthias Kreuseler
JFP
2006
113views more  JFP 2006»
13 years 7 months ago
Efficient manipulation of binary data using pattern matching
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...
Per Gustafsson, Konstantinos F. Sagonas