Sciweavers

359 search results - page 70 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
SAC
2006
ACM
14 years 1 months ago
Semantic analysis of web site audience
With the emergence of the World Wide Web, analyzing and improving Web communication has become essential to adapt the Web content to the visitors’ expectations. Web communicatio...
Jean-Pierre Norguet, Esteban Zimányi, Ralf ...
MICRO
2002
IEEE
164views Hardware» more  MICRO 2002»
14 years 18 days ago
A quantitative framework for automated pre-execution thread selection
Pre-execution attacks cache misses for which conventional address-prediction driven prefetching is ineffective. In pre-execution, copies of cache miss computations are isolated fr...
Amir Roth, Gurindar S. Sohi
SIGCOMM
1998
ACM
13 years 12 months ago
The MASC/BGMP Architecture for Inter-Domain Multicast Routing
Multicast routing enables e cient data distribution to multiple recipients. However, existing work has concentrated on extending single-domain techniques to wide-area networks, ra...
Satish Kumar, Pavlin Radoslavov, David Thaler, Cen...
CVPR
2005
IEEE
14 years 9 months ago
Discriminant Analysis with Tensor Representation
In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First...
Shuicheng Yan, Dong Xu, Qiang Yang, Lei Zhang, Xia...
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla