Sciweavers

5889 search results - page 1117 / 1178
» Graph Layout Problems
Sort
View
SPAA
2009
ACM
15 years 10 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
KDD
2002
ACM
286views Data Mining» more  KDD 2002»
15 years 10 months ago
Object Boundary Detection For Ontology-Based Image Classification
Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential f...
Lei Wang, Latifur Khan, Casey Breen
ICALP
2009
Springer
15 years 10 months ago
Annotations in Data Streams
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
Amit Chakrabarti, Graham Cormode, Andrew McGregor
VLDB
2008
ACM
103views Database» more  VLDB 2008»
15 years 10 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
ATAL
2009
Springer
15 years 4 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...
« Prev « First page 1117 / 1178 Last » Next »