Sciweavers

10271 search results - page 2051 / 2055
» Self-plagiarism in computer science
Sort
View
ECCC
2007
90views more  ECCC 2007»
14 years 11 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
JUCS
2006
117views more  JUCS 2006»
14 years 11 months ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...
OCLC
2008
86views more  OCLC 2008»
14 years 11 months ago
Those who don't look don't find: disciplinary considerations in repository advocacy
Purpose of this paper By describing some of the often ignored aspects of repository advocacy, such as disciplinary differences and how these might affect the adoption of a particu...
Danny Kingsley
PR
2006
164views more  PR 2006»
14 years 11 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
14 years 11 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...
« Prev « First page 2051 / 2055 Last » Next »