Sciweavers

3422 search results - page 523 / 685
» Random Subset Optimization
Sort
View
JGAA
2007
135views more  JGAA 2007»
15 years 3 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
VLSISP
2008
106views more  VLSISP 2008»
15 years 3 months ago
Architecture Considerations for Multi-Format Programmable Video Processors
Many different video processor architectures exist. Its architecture gives a processor strength for a particular application. Hardwired logic yields the best performance/cost, but ...
Jonah Probell
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
15 years 2 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 2 months ago
Non-atomic Games for Multi-User Systems
Abstract—In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful frame...
Nicolas Bonneau, Mérouane Debbah, Eitan Alt...
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 1 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan