Sciweavers

1404 search results - page 86 / 281
» Complexity of admissible rules
Sort
View
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
14 years 2 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
EDBT
2006
ACM
202views Database» more  EDBT 2006»
14 years 9 months ago
Bridging Physical and Virtual Worlds: Complex Event Processing for RFID Data Streams
Advances of sensor and RFID technology provide significant new power for humans to sense, understand and manage the world. RFID provides fast data collection with precise identific...
Fusheng Wang, Shaorong Liu, Peiya Liu, Yijian Bai
IWPEC
2010
Springer
13 years 7 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 6 months ago
Mining Complex Spatio-Temporal Sequence Patterns.
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
Florian Verhein
ALT
2008
Springer
14 years 6 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...