Sciweavers

1380 search results - page 271 / 276
» A General Polynomial Sieve
Sort
View
JCB
2006
107views more  JCB 2006»
13 years 8 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
IJCV
2007
179views more  IJCV 2007»
13 years 8 months ago
Global Detection of Salient Convex Boundaries
As an important geometric property of many structures or structural components, convexity plays an important role in computer vision and image understanding. In this paper, we desc...
Song Wang, Joachim S. Stahl, Adam Bailey, Michael ...
IJISEC
2007
61views more  IJISEC 2007»
13 years 8 months ago
Identity-based key agreement protocols from pairings
In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this ty...
Liqun Chen, Zhaohui Cheng, Nigel P. Smart
IJON
2007
184views more  IJON 2007»
13 years 8 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen