Sciweavers

1391 search results - page 92 / 279
» Complexity Limitations on Quantum Computation
Sort
View
ESOP
2006
Springer
13 years 11 months ago
Type-Based Amortised Heap-Space Analysis
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
Martin Hofmann, Steffen Jost
ECAI
2008
Springer
13 years 9 months ago
A Formal Approach for RDF/S Ontology Evolution
Abstract. In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side...
George Konstantinidis, Giorgos Flouris, Grigoris A...
SDM
2010
SIAM
151views Data Mining» more  SDM 2010»
13 years 9 months ago
Fast Stochastic Frank-Wolfe Algorithms for Nonlinear SVMs
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
Hua Ouyang, Alexander Gray
SPIESR
1997
143views Database» more  SPIESR 1997»
13 years 9 months ago
Similarity Evaluation in Image Retrieval Using Simple Features
The development of increasingly complex multimedia applications calls for new methodologies for the organization and retrieval of still images and video sequences. Query and retri...
Eugenio Di Sciascio, Augusto Celentano
CGF
2007
127views more  CGF 2007»
13 years 7 months ago
Crowds by Example
We present an example-based crowd simulation technique. Most crowd simulation techniques assume that the behavior exhibited by each person in the crowd can be defined by a restri...
Alon Lerner, Yiorgos Chrysanthou, Dani Lischinski