Sciweavers

430 search results - page 30 / 86
» On Using Satisfiability-Based Pruning Techniques in Covering...
Sort
View
EACL
2009
ACL Anthology
15 years 11 months ago
Cube Summing, Approximate Inference with Non-Local Features, and Dynamic Programming without Semirings
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
Kevin Gimpel, Noah A. Smith
EDBT
2008
ACM
159views Database» more  EDBT 2008»
15 years 10 months ago
Automaton in or out: run-time plan optimization for XML stream processing
Many systems such as Tukwila and YFilter combine automaton and algebra techniques to process queries over tokenized XML streams. Typically in this architecture, an automaton is fi...
Hong Su, Elke A. Rundensteiner, Murali Mani
ENTCS
2007
115views more  ENTCS 2007»
14 years 10 months ago
A Global Algorithm for Model-Based Test Suite Generation
Abstract. Model-based testing has been proposed as a technique to automatically verify that a system conforms to its specification. A popular approach is to use a model-checker to...
Anders Hessel, Paul Pettersson
IV
2005
IEEE
136views Visualization» more  IV 2005»
15 years 4 months ago
Improved Visual Clustering of Large Multi-dimensional Data Sets
Lowering computational cost of data analysis and visualization techniques is an essential step towards including the user in the visualization. In this paper we present an improve...
Eduardo Tejada, Rosane Minghim
AMC
2005
138views more  AMC 2005»
14 years 10 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa