Sciweavers

383 search results - page 49 / 77
» A Bound on the Total Chromatic Number
Sort
View
WG
2010
Springer
13 years 8 months ago
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs
Cluster Editing is a classical graph theoretic approach to tackle the problem of data set clustering: it consists of modifying a similarity graph into a disjoint union of cliques,...
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlo...
SPAA
2004
ACM
14 years 3 months ago
Packet-mode policies for input-queued switches
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
Dan Guez, Alexander Kesselman, Adi Rosén
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
14 years 3 months ago
Finding Top-k Similar Pairs of Objects Annotated with Terms from an Ontology
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
Arnab Bhattacharya, Abhishek Bhowmick, Ambuj K. Si...
CORR
2010
Springer
204views Education» more  CORR 2010»
13 years 10 months ago
Limited Feedback Multi-Antenna Quantization Codebook Design-Part II: Multiuser Channels
This is the second part of a two-part paper on optimal design of limited feedback single-user and multiuser spatial multiplexing systems. The first part of the paper studies the si...
Behrouz Khoshnevis, Wei Yu
DSN
2006
IEEE
14 years 4 months ago
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
Antonio Fernández, Ernesto Jiménez, ...