Sciweavers

1918 search results - page 274 / 384
» Discovering Cortical Algorithms
Sort
View
PODS
2008
ACM
141views Database» more  PODS 2008»
14 years 8 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
EDBT
2006
ACM
191views Database» more  EDBT 2006»
14 years 8 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
MOBIHOC
2001
ACM
14 years 7 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
DCC
2007
IEEE
14 years 7 months ago
On the structure of 1-designs with at most two block intersection numbers
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
John Arhin
SDM
2009
SIAM
111views Data Mining» more  SDM 2009»
14 years 5 months ago
A New Constraint for Mining Sets in Sequences.
Discovering interesting patterns in event sequences is a popular task in the field of data mining. Most existing methods try to do this based on some measure of cohesion to deter...
Bart Goethals, Boris Cule, Céline Robardet