1688 search results - page 308 / 338 » The Complexity of Rationalizing Matchings |
ICDCS
2012
IEEE
11 years 10 months ago
2012
IEEE
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...
ICDE
2006
IEEE
14 years 1 months ago
2006
IEEE
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
BMCBI
2007
13 years 7 months ago
2007
Background: Biomedical ontologies are being widely used to annotate biological data in a computer-accessible, consistent and well-defined manner. However, due to their size and co...
COCO
2003
Springer
14 years 28 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We consider the problem of computing the likelihood of a gesture from regular, unaided video sequences, without relying on perfect segmentation of the scene. Instead of requiring ...