Sciweavers

11212 search results - page 51 / 2243
» Semi-persistent Data Structures
Sort
View
NIPS
2003
13 years 11 months ago
Identifying Structure across Pre-partitioned Data
We propose an information-theoretic clustering approach that incorporates a pre-known partition of the data, aiming to identify common clusters that cut across the given partition...
Zvika Marx, Ido Dagan, Eli Shamir
VLDB
1990
ACM
106views Database» more  VLDB 1990»
14 years 2 months ago
The Time Index: An Access Structure for Temporal Data
In this paper, we describe a new indexing technique, the time indez, for improving the performance of certain classes of temporal queries. The time index can be used to retrieve v...
Ramez Elmasri, Gene T. J. Wuu, Yeong-Joon Kim
DBISP2P
2005
Springer
132views Database» more  DBISP2P 2005»
13 years 12 months ago
Publish/Subscribe with RDF Data over Large Structured Overlay Networks
Abstract. We study the problem of evaluating RDF queries over structured overlay networks. We consider the publish/subscribe scenario where nodes subscribe with long-standing queri...
Erietta Liarou, Stratos Idreos, Manolis Koubarakis
AAAI
2008
14 years 8 days ago
Constrained Classification on Structured Data
Most standard learning algorithms, such as Logistic Regression (LR) and the Support Vector Machine (SVM), are designed to deal with i.i.d. (independent and identically distributed...
Chi-Hoon Lee, Matthew R. G. Brown, Russell Greiner...
PAMI
2012
12 years 11 days ago
Simultaneously Fitting and Segmenting Multiple-Structure Data with Outliers
Abstract—We propose a robust fitting framework, called Adaptive Kernel-Scale Weighted Hypotheses (AKSWH), to segment multiplestructure data even in the presence of a large number...
Hanzi Wang, Tat-Jun Chin, David Suter