Sciweavers

822 search results - page 56 / 165
» Descendants in Increasing Trees
Sort
View
IUI
2009
ACM
14 years 7 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...
ICPP
1995
IEEE
14 years 1 months ago
Impact of Load Imbalance on the Design of Software Barriers
Software barriers have been designed and evaluated for barrier synchronization in large-scale shared-memory multiprocessors, under the assumption that all processorsreach the sync...
Alexandre E. Eichenberger, Santosh G. Abraham
KDD
2001
ACM
164views Data Mining» more  KDD 2001»
14 years 10 months ago
Data mining criteria for tree-based regression and classification
This paper is concerned with the construction of regression and classification trees that are more adapted to data mining applications than conventional trees. To this end, we pro...
Andreas Buja, Yung-Seop Lee
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 7 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
GECCO
2004
Springer
14 years 3 months ago
Dynamic Limits for Bloat Control: Variations on Size and Depth
Abstract. We present two important variations on a recently successful bloat control technique, Dynamic Maximum Tree Depth, intended at further improving the results and extending ...
Sara Silva, Ernesto Costa