Sciweavers

2412 search results - page 319 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
INFOCOM
2011
IEEE
13 years 1 months ago
Modeling residual-geometric flow sampling
Abstract—Traffic monitoring and estimation of flow parameters in high speed routers have recently become challenging as the Internet grew in both scale and complexity. In this ...
Xiaoming Wang, Xiaoyong Li, Dmitri Loguinov
ICTAI
2009
IEEE
13 years 8 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux
LOGCOM
2010
158views more  LOGCOM 2010»
13 years 8 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 10 months ago
Mining broad latent query aspects from search sessions
Search queries are typically very short, which means they are often underspecified or have senses that the user did not think of. A broad latent query aspect is a set of keywords ...
Xuanhui Wang, Deepayan Chakrabarti, Kunal Punera
MOBIHOC
2007
ACM
14 years 9 months ago
Capacity scaling in delay tolerant networks with heterogeneous mobile nodes
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...
Michele Garetto, Paolo Giaccone, Emilio Leonardi