Sciweavers

1101 search results - page 179 / 221
» An Algorithm for the Graph Crossing Number Problem
Sort
View
INFOCOM
2009
IEEE
15 years 8 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
CVPR
2006
IEEE
16 years 4 months ago
Composite Templates for Cloth Modeling and Sketching
Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait...
Hong Chen, Zijian Xu, Ziqiang Liu, Song Chun Zhu
SPAA
2006
ACM
15 years 8 months ago
Semi-oblivious routing
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, To...
ICCCN
2007
IEEE
15 years 5 months ago
Exploring Load-Balance to Dispatch Mobile Sensors in Wireless Sensor Networks
In this paper, a hybrid sensor network consisting of static and mobile sensors is considered, where static sensors are used to detect events, and mobile sensors can move to event l...
You-Chiun Wang, Wen-Chih Peng, Min-Hsien Chang, Yu...
NIPS
2008
15 years 3 months ago
Estimating Robust Query Models with Convex Optimization
Query expansion is a long-studied approach for improving retrieval effectiveness by enhancing the user's original query with additional related words. Current algorithms for ...
Kevyn Collins-Thompson