Sciweavers

2492 search results - page 472 / 499
» On the General Signature Trees
Sort
View
COCOA
2007
Springer
14 years 1 months ago
On the Complexity of Some Colorful Problems Parameterized by Treewidth
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
Michael R. Fellows, Fedor V. Fomin, Daniel Lokshta...
GECCO
2007
Springer
256views Optimization» more  GECCO 2007»
14 years 1 months ago
A particle swarm optimization approach for estimating parameter confidence regions
Point estimates of the parameters in real world models convey valuable information about the actual system. However, parameter comparisons and/or statistical inference requires de...
Praveen Koduru, Stephen Welch, Sanjoy Das
IPSN
2007
Springer
14 years 1 months ago
The regiment macroprogramming system
The development of high-level programming environments is essential if wireless sensor networks are to be accessible to nonexperts. In this paper, we present the Regiment system, ...
Ryan Newton, Greg Morrisett, Matt Welsh
KDD
2007
ACM
124views Data Mining» more  KDD 2007»
14 years 1 months ago
Hierarchical mixture models: a probabilistic analysis
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
Mark Sandler
OOPSLA
2007
Springer
14 years 1 months ago
Probabilistic calling context
Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, objectoriented program...
Michael D. Bond, Kathryn S. McKinley