Sciweavers

21324 search results - page 3733 / 4265
» Making the case for computing
Sort
View
WSDM
2010
ACM
172views Data Mining» more  WSDM 2010»
16 years 4 months ago
Early Online Identification of Attention Gathering Items In Social Media
Activity in social media such as blogs, micro-blogs, social networks, etc is manifested via interaction that involves text, images, links and other information items. Naturally, s...
Michael Mathioudakis, Nick Koudas, Peter Marbach
WSDM
2010
ACM
266views Data Mining» more  WSDM 2010»
16 years 4 months ago
Gathering and Ranking Photos of Named Entities with High Precision, High Recall, and Diversity
Knowledge-sharing communities like Wikipedia and automated extraction methods like those of DBpedia enable the construction of large machine-processible knowledge bases with relat...
Bilyana Taneva, Mouna Kacimi, Gerhard Weikum
ICDT
2010
ACM
219views Database» more  ICDT 2010»
16 years 4 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
PPOPP
2010
ACM
16 years 4 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
SPAA
2009
ACM
16 years 4 months ago
A randomized, o(log w)-depth 2 smoothing network
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
Marios Mavronicolas, Thomas Sauerwald
« Prev « First page 3733 / 4265 Last » Next »