Sciweavers

4137 search results - page 327 / 828
» On the number of matchings of a tree
Sort
View
STACS
2010
Springer
16 years 1 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
PLANX
2007
15 years 8 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya
BMCBI
2007
131views more  BMCBI 2007»
15 years 6 months ago
An improved method for identifying functionally linked proteins using phylogenetic profiles
Background: Phylogenetic profiles record the occurrence of homologs of genes across fully sequenced organisms. Proteins with similar profiles are typically components of protein c...
Shawn Cokus, Sayaka Mizutani, Matteo Pellegrini
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
15 years 11 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
TIT
2008
121views more  TIT 2008»
15 years 6 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut