Sciweavers

1272 search results - page 205 / 255
» The Set Cover with Pairs Problem
Sort
View
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
14 years 4 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
ICDT
1999
ACM
82views Database» more  ICDT 1999»
14 years 2 months ago
The Data Warehouse of Newsgroups
Electronic newsgroups are one of the primary means for the dissemination, exchange and sharing of information. We argue that the current newsgroup model is unsatisfactory, especial...
Himanshu Gupta, Divesh Srivastava
IWCM
2004
Springer
14 years 3 months ago
Bayesian Approaches to Motion-Based Image and Video Segmentation
We present a variational approach for segmenting the image plane into regions of piecewise parametric motion given two or more frames from an image sequence. Our model is based on ...
Daniel Cremers
COMPGEOM
2011
ACM
13 years 1 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
ICCV
2005
IEEE
15 years 5 days ago
Vehicle Identification between Non-Overlapping Cameras without Direct Feature Matching
We propose a novel method for identifying road vehicles between two non-overlapping cameras. The problem is formulated as a same-different classification problem: probability of t...
Ying Shan, Harpreet S. Sawhney, Rakesh Kumar