Sciweavers

537 search results - page 89 / 108
» Methods for Evolving Robust Programs
Sort
View
CVPR
2005
IEEE
14 years 2 months ago
Linear Combination Representation for Outlier Detection in Motion Tracking
In this paper we show that Ullman and Basri’s linear combination (LC) representation, which was originally proposed for alignment-based object recognition, can be used for outli...
Guodong Guo, Charles R. Dyer, Zhengyou Zhang
WWW
2003
ACM
14 years 9 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon
TON
2012
11 years 11 months ago
Scalable Lookahead Regular Expression Detection System for Deep Packet Inspection
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
Masanori Bando, N. Sertac Artan, H. Jonathan Chao
RECOMB
2005
Springer
14 years 9 months ago
Modeling the Combinatorial Functions of Multiple Transcription Factors
A considerable fraction of yeast gene promoters are bound by multiple transcription factors. To study the combinatorial interactions of multiple transcription factors is thus impor...
Chen-Hsiang Yeang, Tommi Jaakkola
CVPR
2008
IEEE
14 years 3 months ago
Subspace segmentation with outliers: A grassmannian approach to the maximum consensus subspace
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
Nuno Pinho da Silva, João Paulo Costeira