Sciweavers

3690 search results - page 330 / 738
» Computation with classical sequents
Sort
View
ICIP
2009
IEEE
16 years 6 months ago
Effective Initialization Of K-means For Color Quantization
Color quantization is an important operation with many applications in graphics and image processing. Most quantization methods are essentially based on data clustering algorithms...
ISBI
2006
IEEE
16 years 6 months ago
Atlas-assisted tomography: registration of a deformable atlas to compensate for limited-angle cone-beam trajectory
We present a method to improve the quality of cone-beam tomographic images computed from an intra-operative C-arm scan by adding information from an anatomical atlas. Limited rang...
Ofri Sadowsky, Krishnakumar Ramamurthi, Lotta Mari...
EACL
2009
ACL Anthology
16 years 6 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
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
16 years 6 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
ICALP
2009
Springer
16 years 5 months ago
Rate-Based Transition Systems for Stochastic Process Calculi
A variant of Rate Transition Systems (RTS), proposed by Klin and Sassone, is introduced and used as the basic model for defining stochastic behaviour of processes. The transition r...
Rocco De Nicola, Diego Latella, Michele Loreti, Mi...