Sciweavers

1128 search results - page 125 / 226
» Structuring anonymity metrics
Sort
View
SIGSOFT
2008
ACM
14 years 10 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
PERCOM
2006
ACM
14 years 9 months ago
QoS Routing in OLSR with Several Classes of Service
The Optimized Link State Routing (OLSR) protocol is a proactive link-state protocol bafor ad-hoc networks. It uses an optimization called Multi-Point Relays (MPRs) to provide an e...
Jeremie Leguay, Timur Friedman
ICML
2006
IEEE
14 years 6 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
WWW
2010
ACM
14 years 5 months ago
Visual structure-based web page clustering and retrieval
Clustering and retrieval of web pages dominantly relies on analyzing either the content of individual web pages or the link structure between them. Some literature also suggests t...
Paul Bohunsky, Wolfgang Gatterbauer
3DIC
2009
IEEE
279views Hardware» more  3DIC 2009»
14 years 5 months ago
Compact modelling of Through-Silicon Vias (TSVs) in three-dimensional (3-D) integrated circuits
Abstract—Modeling parasitic parameters of Through-SiliconVia (TSV) structures is essential in exploring electrical characteristics such as delay and signal integrity (SI) of circ...
Roshan Weerasekera, Matt Grange, Dinesh Pamunuwa, ...