Sciweavers

PVLDB
2010
114views more  PVLDB 2010»
13 years 10 months ago
ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data
We present in this paper ObjectRunner, a system for extracting, integrating and querying structured data from the Web. Our system harvests real-world items from template-based HTM...
Talel Abdessalem, Bogdan Cautis, Nora Derouiche
TNN
1998
123views more  TNN 1998»
14 years 2 days ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti
IPM
2006
167views more  IPM 2006»
14 years 12 days ago
Browsing mixed structured and unstructured data
Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. D...
Robert M. Losee
CORR
2007
Springer
134views Education» more  CORR 2007»
14 years 12 days ago
An Analytical Study of a Structured Overlay in the presence of Dynamic Membership
— In this paper, we present a complete analytical study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a master-equation-based approach, which is u...
Supriya Krishnamurthy, Sameh El-Ansary, Erik Aurel...
DEBU
2006
69views more  DEBU 2006»
14 years 14 days ago
Structured Data Meets the Web: A Few Observations
The World Wide Web is witnessing an increase in the amount of structured content
Jayant Madhavan, Alon Y. Halevy, Shirley Cohen, Xi...
FTDB
2008
82views more  FTDB 2008»
14 years 15 days ago
Information Extraction
The automatic extraction of information from unstructured sources has opened up new avenues for querying, organizing, and analyzing data by drawing upon the clean semantics of str...
Sunita Sarawagi
CORR
2008
Springer
104views Education» more  CORR 2008»
14 years 16 days ago
The Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
Bobak Nazer, Michael Gastpar
AUTOMATICA
2008
92views more  AUTOMATICA 2008»
14 years 17 days ago
Generic uniform observability analysis for bilinear systems
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
T. Boukhobza
ISLPED
2010
ACM
193views Hardware» more  ISLPED 2010»
14 years 19 days ago
PASAP: power aware structured ASIC placement
Structured ASICs provide an exciting middle ground between FPGA and ASIC design methodologies. Compared to ASIC, structured ASIC based designs require lower non recurring engineer...
Ashutosh Chakraborty, David Z. Pan