Sciweavers

949 search results - page 167 / 190
» Lightweight Formal Methods for Computer Algebra Systems
Sort
View
SPAA
2004
ACM
14 years 29 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
JASIS
2000
143views more  JASIS 2000»
13 years 7 months ago
Discovering knowledge from noisy databases using genetic programming
s In data mining, we emphasize the need for learning from huge, incomplete and imperfect data sets (Fayyad et al. 1996, Frawley et al. 1991, Piatetsky-Shapiro and Frawley, 1991). T...
Man Leung Wong, Kwong-Sak Leung, Jack C. Y. Cheng
SAC
2005
ACM
14 years 1 months ago
Knowledge based approach to semantic composition of teams in an organization
Finding rapidly suitable experts in an organization to compose a team able to solve specific tasks is a typical problem in large consulting firms. In this paper we present a Des...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
MM
2009
ACM
168views Multimedia» more  MM 2009»
14 years 6 days ago
Identifying news videos' ideological perspectives using emphatic patterns of visual concepts
Television news has become the predominant way of understanding the world around us, but individual news broadcasters can frame or mislead an audience’s understanding of politic...
Wei-Hao Lin, Alexander G. Hauptmann
APSCC
2008
IEEE
13 years 9 months ago
Contract-Based Security Monitors for Service Oriented Software Architecture
Monitors have been used for real-time systems to ensure proper behavior; however, most approaches do not allow for the addition of relevant fields required to identify and react t...
Alexander M. Hoole, Issa Traoré