Sciweavers

1284 search results - page 203 / 257
» Data Structures for Mergeable Trees
Sort
View
WWW
2001
ACM
15 years 10 months ago
IEPAD: information extraction based on pattern discovery
The research in information extraction (IE) regards the generation of wrappers that can extract particular information from semistructured Web documents. Similar to compiler gener...
Chia-Hui Chang, Shao-Chen Lui
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
15 years 4 months ago
Supporting Generic Cost Models for Wide-Area Stream Processing
— Existing stream processing systems are optimized for a specific metric, which may limit their applicability to diverse applications and environments. This paper presents XFlow...
Olga Papaemmanouil, Ugur Çetintemel, John J...
INFOCOM
2007
IEEE
15 years 4 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo
MOBIQUITOUS
2007
IEEE
15 years 4 months ago
A Low-delay Protocol for Multihop Wireless Body Area Networks
—Wireless Body Area Networks (WBANs) form a new and interesting area in the world of remote health monitoring. An important concern in such networks is the communication between ...
Benoît Latré, Bart Braem, Ingrid Moer...
PG
2007
IEEE
15 years 4 months ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang