4526 search results - page 496 / 906 » Algorithmic problems related to the Internet |
192
click to vote
INFOCOM
2003
IEEE
16 years 5 days ago
2003
IEEE
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
210
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
233
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...
166
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
186
click to vote
CADE
2001
Springer
16 years 7 months ago
2001
Springer
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...