Sciweavers

2925 search results - page 415 / 585
» Information Complexity of Online Problems
Sort
View
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
15 years 10 months ago
A Data Model for Moving Objects Supporting Aggregation
Moving objects databases (MOD) have been receiving increasing attention from the database community in recent years, mainly due to the wide variety of applications that technology...
Bart Kuijpers, Alejandro A. Vaisman
155
Voted
ITNG
2007
IEEE
15 years 10 months ago
On Design and Analysis of a Feasible Network-on-Chip (NoC) Architecture
In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput, and simple routing algori...
Jun Ho Bahn, Seung Eun Lee, Nader Bagherzadeh
ECML
2007
Springer
15 years 10 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
ICDM
2006
IEEE
138views Data Mining» more  ICDM 2006»
15 years 10 months ago
Adaptive Blocking: Learning to Scale Up Record Linkage
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
Mikhail Bilenko, Beena Kamath, Raymond J. Mooney
CP
2005
Springer
15 years 9 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus