Sciweavers

18090 search results - page 3029 / 3618
» Computing by Only Observing
Sort
View
KDD
1995
ACM
85views Data Mining» more  KDD 1995»
15 years 10 months ago
Estimating the Robustness of Discovered Knowledge
This paper introduces a new measurement, robustness, to measure the quality of machine-discovered knowledge from real-world databases that change over time. A piece of knowledge i...
Chun-Nan Hsu, Craig A. Knoblock
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 10 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
AMAST
1991
Springer
15 years 10 months ago
Event Spaces and their Linear Logic
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
Vaughan R. Pratt
ARC
2010
Springer
186views Hardware» more  ARC 2010»
15 years 10 months ago
Application-Specific Signatures for Transactional Memory in Soft Processors
As reconfigurable computing hardware and in particular FPGA-based systems-on-chip comprise an increasing number of processor and accelerator cores, supporting sharing and synchroni...
Martin Labrecque, Mark Jeffrey, J. Gregory Steffan
DASFAA
2010
IEEE
213views Database» more  DASFAA 2010»
15 years 10 months ago
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries
Abstract. Continuous monitoring of spatial queries has received significant research attention in the past few years. In this paper, we propose two efficient algorithms for the con...
Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xue...
« Prev « First page 3029 / 3618 Last » Next »