Sciweavers

114 search results - page 13 / 23
» Merging Stratified Knowledge Bases under Constraints
Sort
View
ADHOC
2007
107views more  ADHOC 2007»
13 years 8 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
14 years 9 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
ICC
2009
IEEE
135views Communications» more  ICC 2009»
14 years 2 months ago
Completion Time Minimization and Robust Power Control in Wireless Packet Networks
A wireless packet network is considered in which each user transmits a stream of packets to its destination. The transmit power of each user interferes with the transmission of al...
Chris T. K. Ng, Muriel Médard, Asuman E. Oz...
MMSP
2008
IEEE
245views Multimedia» more  MMSP 2008»
14 years 2 months ago
A convex programming approach for color stereo matching
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
Wided Miled, Béatrice Pesquet-Popescu, Jean...
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
14 years 2 months ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi