Sciweavers

3875 search results - page 642 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 4 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
DEBU
2010
108views more  DEBU 2010»
15 years 4 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
DEDS
2010
130views more  DEDS 2010»
15 years 4 months ago
Message Batching in Wireless Sensor Networks - A Perturbation Analysis Approach
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...
Xu Ning, Christos G. Cassandras
EOR
2008
97views more  EOR 2008»
15 years 4 months ago
Decision making with hybrid influence diagrams using mixtures of truncated exponentials
Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials c...
Barry R. Cobb, Prakash P. Shenoy
COMSIS
2007
167views more  COMSIS 2007»
15 years 4 months ago
Developing a New Color Model for Image Analysis and Processing
The theoretical outcomes and experimental results of new color model implemented in algorithms and software of image processing are presented in the paper. This model, as it will b...
Rashad J. Rasras, Ibrahiem M. M. El Emary, Dimitri...