3864 search results - page 120 / 773 » time 2005 |
141
click to vote
INFOCOM
2005
IEEE
15 years 11 months ago
2005
IEEE
— Medard, Finn, Barry and Gallager proposed an elegant recovery scheme (known as the MFBG scheme) using redundant trees. Xue, Chen and Thulasiraman extended the MFBG scheme and i...
273
click to vote
GIS
2005
ACM
16 years 6 months ago
2005
ACM
Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance informatio...
154
click to vote
DAC
2007
ACM
16 years 6 months ago
2007
ACM
The ability to account for the growing impacts of multiple process variations in modern technologies is becoming an integral part of nanometer VLSI design. Under the context of ti...
161
click to vote
FOCS
2009
IEEE
16 years 11 days ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
163
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
: In many computer vision classification problems, both the error and time characterizes the quality of a decision. We show that such problems can be formalized in the framework of...