Sciweavers

4491 search results - page 508 / 899
» Algorithm Engineering
Sort
View
EDBT
2008
ACM
160views Database» more  EDBT 2008»
16 years 6 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
CLEF
2005
Springer
15 years 12 months ago
SINAI at CLEF 2005: Multi-8 Two-Years-on and Multi-8 Merging-Only Tasks
This year, we have participated on multilingual two years on and Multi-8 merging-only CLEF task. Our main interest has been to test several usual CLIR tasks and investigate how th...
Fernando Martínez Santiago, Miguel Angel Ga...
ISPD
2009
ACM
141views Hardware» more  ISPD 2009»
16 years 1 months ago
A faster approximation scheme for timing driven minimum cost layer assignment
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
Shiyan Hu, Zhuo Li, Charles J. Alpert
AH
2004
Springer
15 years 11 months ago
PROS: A Personalized Ranking Platform for Web Search
Current search engines rely on centralized page ranking algorithms which compute page rank values as single (global) values for each Web page. Recent work on topic-sensitive PageRa...
Paul-Alexandru Chirita, Daniel Olmedilla, Wolfgang...
CAV
2010
Springer
194views Hardware» more  CAV 2010»
15 years 10 months ago
LTSmin: Distributed and Symbolic Reachability
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...
Stefan Blom, Jaco van de Pol, Michael Weber