1458 search results - page 179 / 292 » Practical Preference Relations for Large Data Sets |
179
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
134
click to vote
DASFAA
2008
IEEE
15 years 7 months ago
2008
IEEE
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
136
click to vote
PERCOM
2007
ACM
16 years 5 months ago
2007
ACM
Activity monitoring, a crucial task in many applications, is often conducted expensively using video cameras. Also, effectively monitoring a large field by analyzing images from m...
157
click to vote
ICNP
2005
IEEE
15 years 11 months ago
2005
IEEE
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
138
click to vote
VISUALIZATION
2002
IEEE
15 years 10 months ago
2002
IEEE
We present a method for interactive rendering of large outdoor scenes. Complex polygonal plant models and whole plant populations are represented by relatively small sets of point...