Sciweavers

1272 search results - page 53 / 255
» The Set Cover with Pairs Problem
Sort
View
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
15 years 25 days ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
101
Voted
IJSNET
2006
110views more  IJSNET 2006»
15 years 22 days ago
Improving network lifetime using sensors with adjustable sensing ranges
Abstract: This paper addresses the target coverage problem in wireless sensor networks with adjustable sensing range. Communication and sensing consume energy, therefore efficient ...
Mihaela Cardei, Jie Wu, Mingming Lu
82
Voted
BSL
2005
106views more  BSL 2005»
15 years 19 days ago
Compactness and independence in non first order frameworks
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...
Itay Ben-Yaacov
COLING
2008
15 years 2 months ago
Detecting Multiple Facets of an Event using Graph-Based Unsupervised Methods
We propose a new unsupervised method for topic detection that automatically identifies the different facets of an event. We use pointwise Kullback-Leibler divergence along with th...
Pradeep Muthukrishnan, Joshua Gerrish, Dragomir R....
111
Voted
ICPR
2004
IEEE
16 years 1 months ago
Hand Gesture Recognition: Self-Organising Maps as a Graphical User Interface for the Partitioning of Large Training Data Sets
Gesture recognition is a difficult task in computer vision due to the numerous degrees of freedom of a human hand. Fortunately, human gesture covers only a small part of the theor...
Axel Saalbach, Gunther Heidemann, Holger Bekel, In...