Sciweavers

2107 search results - page 318 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
CACM
2010
140views more  CACM 2010»
13 years 6 months ago
FastTrack: efficient and precise dynamic race detection
Multithreaded programs are notoriously prone to race conditions. Prior work on dynamic race detectors includes fast but imprecise race detectors that report false alarms, as well ...
Cormac Flanagan, Stephen N. Freund
NDQA
2003
131views Education» more  NDQA 2003»
13 years 10 months ago
Panel on Web-Based Question Answering
Early TREC-style Question Answering Systems were characterized by the following features: (a) the answer of the question was known to be included in a given local corpus, (b) the ...
Dragomir R. Radev
BMCBI
2007
132views more  BMCBI 2007»
13 years 9 months ago
Analysis of probe level patterns in Affymetrix microarray data
Background: Microarrays have been used extensively to analyze the expression profiles for thousands of genes in parallel. Most of the widely used methods for analyzing Affymetrix ...
Alexander C. Cambon, Abdelnaby Khalyfa, Nigel G. F...
CORR
2010
Springer
201views Education» more  CORR 2010»
13 years 6 months ago
Online Advertisement, Optimization and Stochastic Networks
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these compan...
R. Srikant
PODC
2006
ACM
14 years 3 months ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer