Sciweavers

3105 search results - page 474 / 621
» The Path-Packing Structure of Graphs
Sort
View
ISAAC
1995
Springer
97views Algorithms» more  ISAAC 1995»
15 years 7 months ago
A Linear Time Algorithm For Finding Maximal Planar Subgraphs
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
Wen-Lian Hsu
137
Voted
ECCV
2010
Springer
15 years 7 months ago
Discovering Multipart Appearance Models from Captioned Images
Abstract. Even a relatively unstructured captioned image set depicting a variety of objects in cluttered scenes contains strong correlations between caption words and repeated visu...
BIOSURVEILLANCE
2008
Springer
15 years 5 months ago
Dynamic Network Model for Predicting Occurrences of Salmonella at Food Facilities
Salmonella is among the most common food borne illnesses which may result from consumption of contaminated products. In this paper we model the co-occurrence data between USDA-cont...
Purnamrita Sarkar, Lujie Chen, Artur Dubrawski
EKAW
2006
Springer
15 years 5 months ago
A Formal Approach to Qualitative Reasoning on Topological Properties of Networks
Abstract. Qualitative reasoning uses a limited set of relevant distinctions of the domain to allow a flexible way of representing and reasoning about it. This work presents a conce...
Andrea Rodríguez, Claudio Gutierrez
139
Voted
ECAI
2008
Springer
15 years 5 months ago
Reinforcement Learning with Classifier Selection for Focused Crawling
Focused crawlers are programs that wander in the Web, using its graph structure, and gather pages that belong to a specific topic. The most critical task in Focused Crawling is the...
Ioannis Partalas, Georgios Paliouras, Ioannis P. V...