Sciweavers

65 search results - page 12 / 13
» Online B-tree Merging
Sort
View
SIGUCCS
2006
ACM
14 years 6 days ago
We got the message: creating an instant messenger service point
Figuring out the best way to communicate with and serve students is one of the paramount challenges facing library and technology organizations today, including Bucknell Universit...
Jason Snyder, Meredith Field
IOPADS
1997
152views more  IOPADS 1997»
13 years 7 months ago
Competitive Parallel Disk Prefetching and Buffer Management
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
Rakesh D. Barve, Mahesh Kallahalla, Peter J. Varma...
TACAS
2009
Springer
101views Algorithms» more  TACAS 2009»
14 years 1 months ago
Parametric Trace Slicing and Monitoring
Analysis of execution traces plays a fundamental role in many program analysis approaches. Execution traces are frequently parametric, i.e., they contain events with parameter bind...
Feng Chen, Grigore Rosu
ICCV
2007
IEEE
14 years 17 days ago
Simultaneous Segmentation and 3D Reconstruction of Monocular Image Sequences
When trying to extract 3D scene information and camera motion from an image sequence alone, it is often necessary to cope with independently moving objects. Recent research has un...
Kemal Egemen Ozden, Konrad Schindler, Luc J. Van G...
JCDL
2005
ACM
95views Education» more  JCDL 2005»
13 years 11 months ago
Resolving the unencoded character problem for chinese digital libraries
Constructing a Chinese digital library, especially for a historical article archiving, is often bothered by the small character sets supported by the current computer systems. Thi...
Derming Juang, Jenq-Haur Wang, Chen-Yu Lai, Ching-...