Sciweavers

4850 search results - page 204 / 970
» Approximate Data Structures with Applications
Sort
View
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
16 years 15 days ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
JAVA
2000
Springer
15 years 10 months ago
A portable sampling-based profiler for Java virtual machines
This paper describes a portable and efficient sampling-based online measurement system for production-level Java virtual machines. This system is designed to provide continuous re...
John Whaley
ICDE
2001
IEEE
104views Database» more  ICDE 2001»
16 years 7 months ago
Bundles in Captivity: An Application of Superimposed Information
What do you do to make sense of a mass of information on a given topic? Paradoxically, you likely add yet more information to the pile: annotations, underlining, bookmarks, cross-...
Lois M. L. Delcambre, David Maier, Shawn Bowers, M...
INTERNET
2006
157views more  INTERNET 2006»
15 years 6 months ago
Distributed Data Mining in Peer-to-Peer Networks
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
Souptik Datta, Kanishka Bhaduri, Chris Giannella, ...
CHI
2005
ACM
15 years 8 months ago
Why use memo for all?: restructuring mobile applications to support informal note taking
Informal note taking is an essential activity in Personal Information Management (PIM). Most mobile devices support this via a suite of applications, employing both highly structu...
Liwei Dai, Wayne G. Lutters, Carlie Bower