Sciweavers

1403 search results - page 56 / 281
» Set cover algorithms for very large datasets
Sort
View
CAV
2010
Springer
239views Hardware» more  CAV 2010»
15 years 8 months ago
Model Checking of Linearizability of Concurrent List Implementations
Abstract. Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations do...
Pavol Cerný, Arjun Radhakrishna, Damien Zuf...
ICASSP
2009
IEEE
15 years 10 months ago
Using collective information in semi-supervised learning for speech recognition
Training accurate acoustic models typically requires a large amount of transcribed data, which can be expensive to obtain. In this paper, we describe a novel semi-supervised learn...
Balakrishnan Varadarajan, Dong Yu, Li Deng, Alex A...
VLDB
2002
ACM
154views Database» more  VLDB 2002»
15 years 3 months ago
I/O-Conscious Data Preparation for Large-Scale Web Search Engines
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
Maxim Lifantsev, Tzi-cker Chiueh
135
Voted
HCI
2009
15 years 1 months ago
Sign Language Recognition: Working with Limited Corpora
The availability of video format sign language corpora limited. This leads to a desire for techniques which do not rely on large, fully-labelled datasets. This paper covers various...
Helen Cooper, Richard Bowden
UAI
2008
15 years 5 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel