Sciweavers

4526 search results - page 72 / 906
» Algorithmic problems related to the Internet
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
COCO
1991
Springer
130views Algorithms» more  COCO 1991»
15 years 1 months ago
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
Rafail Ostrovsky
WWW
2007
ACM
15 years 10 months ago
U-REST: an unsupervised record extraction system
In this paper, we describe a system that can extract record structures from web pages with no direct human supervision. Records are commonly occurring HTML-embedded data tuples th...
Yuan Kui Shen, David R. Karger
HT
1987
ACM
15 years 1 months ago
Exploring Representation Problems Using Hypertext
Hypertext is a technology well-suited to exploring different kinds of representational problems. It can be used first as an informal mechanism to describe the attributes of object...
Catherine C. Marshall
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
14 years 10 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen