Sciweavers

299 search results - page 32 / 60
» Implicit Enumeration of Patterns
Sort
View
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
14 years 3 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 ...
ICDE
2007
IEEE
207views Database» more  ICDE 2007»
14 years 11 months ago
SIGOPT: Using Schema to Optimize XML Query Processing
There has been a great deal of work in recent years on processing and optimizing queries against XML data. Typically in these previous works, schema information is not considered,...
Stelios Paparizos, Jignesh M. Patel, H. V. Jagadis...
CADE
2005
Springer
14 years 10 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
14 years 7 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
PKDD
2009
Springer
95views Data Mining» more  PKDD 2009»
14 years 4 months ago
Non-redundant Subgroup Discovery Using a Closure System
Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function. As standard quality functio...
Mario Boley, Henrik Grosskreutz