Sciweavers

4536 search results - page 216 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
PRICAI
1998
Springer
15 years 6 months ago
Point-Based Approaches to Qualitative Temporal Reasoning
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
Tim Van Allen, James P. Delgrande, Arvind Gupta
SCHOLARPEDIA
2008
89views more  SCHOLARPEDIA 2008»
15 years 21 days ago
Support vector clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur
137
Voted
ICCV
2009
IEEE
15 years 59 min ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 9 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
WEBDB
2007
Springer
79views Database» more  WEBDB 2007»
15 years 8 months ago
Navigating Extracted Data with Schema Discovery
Open Information Extraction (OIE) is a recently-introduced type of information extraction that extracts small individual pieces of data from input text without any domainspecific...
Michael J. Cafarella, Dan Suciu, Oren Etzioni