Sciweavers

325 search results - page 61 / 65
» Hamilton cycles in random graphs and directed graphs
Sort
View
ICCV
2009
IEEE
1069views Computer Vision» more  ICCV 2009»
15 years 13 days ago
An efficient algorithm for Co-segmentation
This paper is focused on the Co-segmentation problem [1] – where the objective is to segment a similar object from a pair of images. The background in the two images may be ar...
Dorit S. Hochbaum, Vikas Singh
INFOCOM
2008
IEEE
14 years 1 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
ICMCS
2007
IEEE
112views Multimedia» more  ICMCS 2007»
14 years 1 months ago
Detecting Unsafe Driving Patterns using Discriminative Learning
We propose a discriminative learning approach for fusing multichannel sequential data with application to detect unsafe driving patterns from multi-channel driving recording data....
Yue Zhou, Wei Xu, Huazhong Ning, Yihong Gong, Thom...
WEBI
2007
Springer
14 years 1 months ago
Blog Community Discovery and Evolution Based on Mutual Awareness Expansion
There are information needs involving costly decisions that cannot be efficiently satisfied through conventional web search engines. Alternately, community centric search can prov...
Yu-Ru Lin, Hari Sundaram, Yun Chi, Jun'ichi Tatemu...
PAM
2004
Springer
14 years 25 days ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella