Sciweavers

401 search results - page 79 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 6 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
ICCV
2009
IEEE
13 years 5 months ago
BLOGS: Balanced local and global search for non-degenerate two view epipolar geometry
This work considers the problem of estimating the epipolar geometry between two cameras without needing a prespecified set of correspondences. It is capable of resolving the epipo...
Aveek S. Brahmachari, Sudeep Sarkar
POPL
2009
ACM
14 years 2 months ago
Low-pain, high-gain multicore programming in Haskell: coordinating irregular symbolic computations on multicore architectures
With the emergence of commodity multicore architectures, exploiting tightly-coupled parallelism has become increasingly important. Functional programming languages, such as Haskel...
Abdallah Al Zain, Kevin Hammond, Jost Berthold, Ph...
CAIP
2005
Springer
14 years 28 days ago
Virtual Garment Pre-positioning
In this paper, we present an easy method for automatic 3D garment pre-positioning. Given a digital 3D mannequin and a set of 2D patterns, the problem consists in sewing automatical...
Tung Le Thanh, André Gagalowicz
SSD
2001
Springer
128views Database» more  SSD 2001»
13 years 11 months ago
Creating Representations for Continuously Moving Regions from Observations
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...
Erlend Tøssebro, Ralf Hartmut Güting