1007 search results - page 77 / 202 » The Complexity of Futile Questioning |
162
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: During the most recent decade many Bayesian statistical models and software for answering questions related to the genetic structure underlying population samples have...
153
Voted
TCS
2010
15 years 2 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
130
Voted
ICDM
2009
IEEE
15 years 1 months ago
2009
IEEE
Recently a number of modeling techniques have been developed for data mining and machine learning in relational and network domains where the instances are not independent and ide...
158
click to vote
IEEEVAST
2010
14 years 10 months ago
2010
Finding patterns in temporal data is an important data analysis task in many domains. Static visualizations can help users easily see certain instances of patterns, but are not sp...
163
Voted
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...