Sciweavers

1322 search results - page 181 / 265
» Parameterized counting problems
Sort
View
119
Voted
CG
2007
Springer
15 years 3 months ago
Graphtracker: A topology projection invariant optical tracker
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
Ferdi A. Smit, Arjen van Rhijn, Robert van Liere
151
Voted
TCS
2008
15 years 3 months ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
128
Voted
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
15 years 9 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
DAC
2005
ACM
16 years 4 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...
KDD
2006
ACM
240views Data Mining» more  KDD 2006»
16 years 4 months ago
Adaptive event detection with time-varying poisson processes
Time-series of count data are generated in many different contexts, such as web access logging, freeway traffic monitoring, and security logs associated with buildings. Since this...
Alexander T. Ihler, Jon Hutchins, Padhraic Smyth