Sciweavers

2126 search results - page 387 / 426
» An optimization algorithm for imprecise multi-objective prob...
Sort
View
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
15 years 10 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 3 months ago
Lower bounds for predecessor searching in the cell probe model
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...
Pranab Sen
MM
2004
ACM
167views Multimedia» more  MM 2004»
15 years 3 months ago
Learning an image manifold for retrieval
We consider the problem of learning a mapping function from low-level feature space to high-level semantic space. Under the assumption that the data lie on a submanifold embedded ...
Xiaofei He, Wei-Ying Ma, HongJiang Zhang
SIGMOD
2007
ACM
162views Database» more  SIGMOD 2007»
15 years 10 months ago
Effective and efficient update of xml in RDBMS
Querying XML effectively and efficiently using declarative languages such as XQuery and XPath has been widely studied in both academic and industrial settings. Most RDBMS vendors ...
Zhen Hua Liu, Muralidhar Krishnaprasad, James W. W...
ATAL
2003
Springer
15 years 3 months ago
Risk-averse auction agents
Auctions are an important means for purchasing material in the era of e-commerce. Research on auctions often studies them in isolation. In practice, however, auction agents are pa...
Yaxin Liu, Richard Goodwin, Sven Koenig