Sciweavers

389 search results - page 72 / 78
» Some natural decision problems in automatic graphs
Sort
View
PLDI
2009
ACM
14 years 1 months ago
PetaBricks: a language and compiler for algorithmic choice
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...
Jason Ansel, Cy P. Chan, Yee Lok Wong, Marek Olsze...
BMCBI
2010
106views more  BMCBI 2010»
13 years 1 months ago
Identification and correction of previously unreported spatial phenomena using raw Illumina BeadArray data
Background: A key stage for all microarray analyses is the extraction of feature-intensities from an image. If this step goes wrong, then subsequent preprocessing and processing s...
Mike L. Smith, Mark J. Dunning, Simon Tavaré...
ECCV
2006
Springer
14 years 8 months ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
ECAI
2004
Springer
14 years 3 days ago
Emergence of Complex Networks through Local Optimization
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
Josep M. Pujol, Andreas Flache, Ramon Sangües...
AAMAS
2012
Springer
12 years 2 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...