Sciweavers

3146 search results - page 28 / 630
» Efficient Consequence Finding
Sort
View
JUCS
2002
131views more  JUCS 2002»
13 years 9 months ago
Finding Median Partitions Using Information-Theoretical-Based Genetic Algorithms
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...
Dana Cristofor, Dan A. Simovici
ICDE
2006
IEEE
137views Database» more  ICDE 2006»
14 years 11 months ago
Finding Fastest Paths on A Road Network with Speed Patterns
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zha...
ICPR
2006
IEEE
14 years 11 months ago
Finding Text in Natural Scenes by Figure-Ground Segmentation
Much past research on finding text in natural scenes uses bottom-up grouping processes to detect candidate text features as a first processing step. While such grouping procedures...
Huiying Shen, James Coughlan
WWW
2004
ACM
14 years 10 months ago
FADA: find all distinct answers
The wealth of information available on the web makes it an attractive resource for seeking quick answers. While web-based question answering becomes an emerging topic in recent ye...
Hui Yang, Tat-Seng Chua
OSDI
2008
ACM
14 years 10 months ago
Finding and Reproducing Heisenbugs in Concurrent Programs
Concurrency is pervasive in large systems. Unexpected interference among threads often results in "Heisenbugs" that are extremely difficult to reproduce and eliminate. W...
Gérard Basler, Iulian Neamtiu, Madanlal Mus...