Sciweavers

4325 search results - page 800 / 865
» Incremental computation with names
Sort
View
CVIU
2007
193views more  CVIU 2007»
14 years 11 months ago
Interpretation of complex scenes using dynamic tree-structure Bayesian networks
This paper addresses the problem of object detection and recognition in complex scenes, where objects are partially occluded. The approach presented herein is based on the hypothe...
Sinisa Todorovic, Michael C. Nechyba
JOT
2008
136views more  JOT 2008»
14 years 11 months ago
The Stock Statistics Parser
This paper describes how use the HTMLEditorKit to perform web data mining on stock statistics for listed firms. Our focus is on making use of the web to get information about comp...
Douglas Lyon
TELSYS
2008
85views more  TELSYS 2008»
14 years 11 months ago
Trustworthy Web services provisioning for differentiated customer services
With the number of e-Business applications dramatically increasing, a service level agreement (SLA) will play an important part in Web services. The SLA is a combination of severa...
Kaiqi Xiong, Harry G. Perros
BMCBI
2005
127views more  BMCBI 2005»
14 years 11 months ago
Genomes are covered with ubiquitous 11 bp periodic patterns, the "class A flexible patterns"
Background: The genomes of prokaryotes and lower eukaryotes display a very strong 11 bp periodic bias in the distribution of their nucleotides. This bias is present throughout a g...
Etienne Larsabal, Antoine Danchin
TOC
2008
94views more  TOC 2008»
14 years 11 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai