Sciweavers

3378 search results - page 640 / 676
» A universe of binding and computation
Sort
View
ANCS
2005
ACM
15 years 11 months ago
Resource mapping and scheduling for heterogeneous network processor systems
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinh...
IMC
2005
ACM
15 years 11 months ago
Exploiting Underlying Structure for Detailed Reconstruction of an Internet-scale Event
Network “telescopes” that record packets sent to unused blocks of Internet address space have emerged as an important tool for observing Internet-scale events such as the spre...
Abhishek Kumar, Vern Paxson, Nicholas Weaver
JCDL
2005
ACM
100views Education» more  JCDL 2005»
15 years 11 months ago
What's there and what's not?: focused crawling for missing documents in digital libraries
Some large scale topical digital libraries, such as CiteSeer, harvest online academic documents by crawling open-access archives, university and author homepages, and authors’ s...
Ziming Zhuang, Rohit Wagle, C. Lee Giles
CIKM
2005
Springer
15 years 11 months ago
Maximal termsets as a query structuring mechanism
Search engines process queries conjunctively to restrict the size of the answer set. Further, it is not rare to observe a mismatch between the vocabulary used in the text of Web p...
Bruno Pôssas, Nivio Ziviani, Berthier A. Rib...
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
15 years 11 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...