Sciweavers

16430 search results - page 44 / 3286
» On Computable Tree Functions
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
VISUALIZATION
2002
IEEE
14 years 19 days ago
Christmas Tree Case Study: Computed Tomography as a Tool for Mastering Complex Real World Objects with Applications in Computer
We report on using computed tomography (CT) as a model acquisition tool for complex objects in computer graphics. Unlike other modeling and scanning techniques the complexity of t...
Armin Kanitsar, Thomas Theußl, Lukas Mroz, M...
WABI
2005
Springer
14 years 1 months ago
Computing the Quartet Distance Between Trees of Arbitrary Degree
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
Chris Christiansen, Thomas Mailund, Christian N. S...
AMC
2006
89views more  AMC 2006»
13 years 7 months ago
A functional computation model for the duality of two-variable Lambda-Boolean functions
This paper presents a new functional computation model for developing a class of two-variable Lambda-Boolean functions, and describes the properties of the duality principle on th...
Tolga Güyer, Seref Mirasyedioglu
ICDCS
2006
IEEE
14 years 1 months ago
Greedy is Good: On Service Tree Placement for In-Network Stream Processing
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...
Zoë Abrams, Jie Liu