Sciweavers

456 search results - page 71 / 92
» Extending Problem Frames to deal with stakeholder problems
Sort
View
BIRD
2008
Springer
162views Bioinformatics» more  BIRD 2008»
15 years 1 months ago
Suffix Tree Characterization of Maximal Motifs in Biological Sequences
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
Maria Federico, Nadia Pisanti
AINA
2009
IEEE
15 years 6 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
SPATIALCOGNITION
2004
Springer
15 years 5 months ago
Branching Allen
Allen’s interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restric...
Marco Ragni, Stefan Wölfl
ICDCS
2000
IEEE
15 years 4 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
IJCV
2006
145views more  IJCV 2006»
14 years 11 months ago
Simultaneous Object Recognition and Segmentation from Single or Multiple Model Views
We present a novel Object Recognition approach based on affine invariant regions. It actively counters the problems related to the limited repeatability of the region detectors, an...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...