Sciweavers

9842 search results - page 332 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
HICSS
2002
IEEE
130views Biometrics» more  HICSS 2002»
15 years 9 months ago
Designing Complex Software Implementation Programs
The central question of this paper is: How can design of Program Management contribute to the success of complex software implementations? Incomplete goal specifications, lack of ...
Pieter M. A. Ribbers, Klaus-Clemens Schoo
CVPR
2003
IEEE
16 years 6 months ago
Recognising and Monitoring High-Level Behaviours in Complex Spatial Environments
The recognition of activities from sensory data is important in advanced surveillance systems to enable prediction of high-level goals and intentions of the target under surveilla...
Nam Thanh Nguyen, Hung Hai Bui, Svetha Venkatesh, ...
POPL
2008
ACM
16 years 4 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
EDBT
2002
ACM
179views Database» more  EDBT 2002»
16 years 4 months ago
Efficient Complex Query Support for Multiversion XML Documents
Managing multiple versions of XML documents represents a critical requirement for many applications. Also, there has been much recent interest in supporting complex queries on XML ...
Shu-Yao Chien, Vassilis J. Tsotras, Carlo Zaniolo,...
CEC
2007
IEEE
15 years 10 months ago
On the analysis of average time complexity of estimation of distribution algorithms
— Estimation of Distribution Algorithm (EDA) is a well-known stochastic optimization technique. The average time complexity is a crucial criterion that measures the performance o...
Tianshi Chen, Ke Tang, Guoliang Chen, Xin Yao