Sciweavers

2192 search results - page 378 / 439
» Algorithms for Challenging Motif Problems
Sort
View
ECCV
2008
Springer
15 years 12 months ago
SIFT Flow: Dense Correspondence across Different Scenes
While image registration has been studied in different areas of computer vision, aligning images depicting different scenes remains a challenging problem, closer to recognition tha...
Ce Liu, Jenny Yuen, Antonio B. Torralba, Josef Siv...
DAC
2005
ACM
15 years 11 months ago
Multilevel full-chip routing for the X-based architecture
As technology advances into the nanometer territory, the interconnect delay has become a first-order effect on chip performance. To handle this effect, the X-architecture has been...
Tsung-Yi Ho, Chen-Feng Chang, Yao-Wen Chang, Sao-J...
WWW
2009
ACM
15 years 10 months ago
Efficient interactive fuzzy keyword search
Traditional information systems return answers after a user submits a complete query. Users often feel "left in the dark" when they have limited knowledge about the unde...
Shengyue Ji, Guoliang Li, Chen Li, Jianhua Feng
MOBIHOC
2009
ACM
15 years 10 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
MOBIHOC
2009
ACM
15 years 10 months ago
Predict and relay: an efficient routing in disruption-tolerant networks
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
Quan Yuan, Ionut Cardei, Jie Wu