Sciweavers

6943 search results - page 654 / 1389
» Representations for evolutionary algorithms
Sort
View
ECML
2004
Springer
16 years 29 days ago
Conditional Independence Trees
It has been observed that traditional decision trees produce poor probability estimates. In many applications, however, a probability estimation tree (PET) with accurate probabilit...
Harry Zhang, Jiang Su
RT
1998
Springer
15 years 11 months ago
Image-Based Rendering for Non-Diffuse Synthetic Scenes
Most current image-based rendering methods operate under the assumption that all of the visible surfaces in the scene are opaque ideal diffuse (Lambertian) reflectors. This paper i...
Dani Lischinski, Ari Rappoport
CASCON
1996
126views Education» more  CASCON 1996»
15 years 9 months ago
Inter-class testing of O-O software in the presence of polymorphism
This paper1 describes an algorithm for testing polymorphic interactions between classes in object-oriented (O-O) software. We propose an Augmented Object Relationship Diagram (AOR...
Amit M. Paradkar
ECCV
2010
Springer
15 years 8 months ago
Robust and Fast Collaborative Tracking with Two Stage Sparse Optimization
Abstract. The sparse representation has been widely used in many areas and utilized for visual tracking. Tracking with sparse representation is formulated as searching for samples ...
Baiyang Liu, Lin Yang, Junzhou Huang, Peter Meer, ...
ENTCS
2008
99views more  ENTCS 2008»
15 years 7 months ago
SPPF-Style Parsing From Earley Recognisers
In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave ...
Elizabeth Scott