Sciweavers

4526 search results - page 365 / 906
» Algorithmic problems related to the Internet
Sort
View
CVPR
2010
IEEE
16 years 3 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
DAM
2006
132views more  DAM 2006»
15 years 6 months ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler
WWW
2006
ACM
16 years 7 months ago
Dynamic placement for clustered web applications
We introduce and evaluate a middleware clustering technology capable of allocating resources to web applications through dynamic application instance placement. We define applicat...
A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike S...
WWW
2006
ACM
16 years 7 months ago
Web ontology segmentation: analysis, classification and use
Ontologies are at the heart of the semantic web. They define the concepts and relationships that make global interoperability possible. However, as these ontologies grow in size t...
Julian Seidenberg, Alan L. Rector
WWW
2006
ACM
16 years 7 months ago
Probabilistic models for discovering e-communities
The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
Ding Zhou, Eren Manavoglu, Jia Li, C. Lee Giles, H...