Sciweavers

1040 search results - page 153 / 208
» Rounding algorithms for covering problems
Sort
View
CVPR
2010
IEEE
15 years 5 months ago
Detecting and Parsing Architecture at City Scale from Range Data
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
Alexander Toshev, Philippos Mordohai, Ben Taskar
GFKL
2004
Springer
154views Data Mining» more  GFKL 2004»
15 years 3 months ago
Discovering Temporal Knowledge in Multivariate Time Series
Abstract. An overview of the Time Series Knowledge Mining framework to discover knowledge in multivariate time series is given. A hierarchy of temporal patterns, which are not a pr...
Fabian Mörchen, Alfred Ultsch
ICALP
2010
Springer
15 years 2 months ago
The Downward-Closure of Petri Net Languages
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
Peter Habermehl, Roland Meyer, Harro Wimmel
WADS
1997
Springer
108views Algorithms» more  WADS 1997»
15 years 1 months ago
Dynamic Data Structures for Fat Objects and Their Applications
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
Alon Efrat, Matthew J. Katz, Frank Nielsen, Micha ...
FCCM
2009
IEEE
204views VLSI» more  FCCM 2009»
15 years 1 months ago
Acceleration and Energy Efficiency of a Geometric Algebra Computation using Reconfigurable Computers and GPUs
Geometric algebra (GA) is a mathematical framework that allows the compact description of geometric relationships and algorithms in many fields of science and engineering. The exe...
Holger Lange, Florian Stock, Andreas Koch, Dietmar...