Sciweavers

796 search results - page 106 / 160
» Approximating the centroid is hard
Sort
View
ICFCA
2007
Springer
16 years 9 days ago
Computing Intensions of Digital Library Collections
We model a Digital Library as a formal context in which objects are documents and attributes are terms describing documents contents. A formal concept is very close to the notion o...
Carlo Meghini, Nicolas Spyratos
WABI
2007
Springer
109views Bioinformatics» more  WABI 2007»
16 years 7 days ago
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
Réka Albert, Bhaskar DasGupta, Riccardo Don...
WIDM
2006
ACM
16 years 2 days ago
Identifying redundant search engines in a very large scale metasearch engine context
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
Ronak Desai, Qi Yang, Zonghuan Wu, Weiyi Meng, Cle...
IWPC
2005
IEEE
15 years 11 months ago
Concise and Consistent Naming
Approximately 70% of the source code of a software system consists of identifiers. Hence, the names chosen as identifiers are of paramount importance for the readability of comp...
Florian Deißenböck, Markus Pizka
WIOPT
2005
IEEE
15 years 11 months ago
Minimum Energy Transmission Scheduling Subject to Deadline Constraints
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
Alessandro Tarello, Jun Sun 0007, Murtaza Zafer, E...