Sciweavers

28888 search results - page 5764 / 5778
» Computability and complexity in analysis
Sort
View
ECCC
2011
207views ECommerce» more  ECCC 2011»
13 years 4 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
COST
2010
Springer
194views Multimedia» more  COST 2010»
13 years 4 months ago
The MultiLis Corpus - Dealing with Individual Differences in Nonverbal Listening Behavior
Abstract. Computational models that attempt to predict when a virtual human should backchannel are often based on the analysis of recordings of face-to-face conversations between h...
Iwan de Kok, Dirk Heylen
TC
2011
13 years 4 months ago
Performing Arithmetic Operations on Round-to-Nearest Representations
—During any composite computation, there is a constant need for rounding intermediate results before they can participate in further processing. Recently, a class of number repre...
Peter Kornerup, Jean-Michel Muller, Adrien Panhale...
VLDB
2011
ACM
251views Database» more  VLDB 2011»
13 years 3 months ago
Harvesting relational tables from lists on the web
A large number of web pages contain data structured in the form of “lists”. Many such lists can be further split into multi-column tables, which can then be used in more seman...
Hazem Elmeleegy, Jayant Madhavan, Alon Y. Halevy
WWW
2011
ACM
13 years 3 months ago
we.b: the web of short urls
Short URLs have become ubiquitous. Especially popular within social networking services, short URLs have seen a significant increase in their usage over the past years, mostly du...
Demetres Antoniades, Iasonas Polakis, Georgios Kon...
« Prev « First page 5764 / 5778 Last » Next »