3055 search results - page 286 / 611 » Randomized Search Trees |
130
click to vote
IANDC
2008
15 years 3 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
142
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
138
Voted
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
139
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
168
Voted
PAMI
2011
14 years 10 months ago
2011
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...