Sciweavers

310 search results - page 7 / 62
» Randomized Binary Search Trees
Sort
View
IUI
2009
ACM
14 years 5 months ago
Searching large indexes on tiny devices: optimizing binary search with character pinning
The small physical size of mobile devices imposes dramatic restrictions on the user interface (UI). With the ever increasing capacity of these devices as well as access to large o...
Guy Shani, Christopher Meek, Tim Paek, Bo Thiesson...
CP
2006
Springer
14 years 7 days ago
Reasoning by Dominance in Not-Equals Binary Constraint Networks
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Belaid Benhamou, Mohamed Réda Saïdi
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 8 months ago
Key-Independent Optimality
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
John Iacono
ISCIS
2009
Springer
14 years 1 months ago
Calculating the VC-dimension of decision trees
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
Ozlem Asian, Olcay Taner Yildiz, Ethem Alpaydin