Sciweavers

1507 search results - page 88 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
EUROMICRO
2009
IEEE
14 years 1 months ago
Synthetic Metrics for Evaluating Runtime Quality of Software Architectures with Complex Tradeoffs
Runtime quality of software, such as availability and throughput, depends on architectural factors and execution environment characteristics (e.g. CPU speed, network latency). Alth...
Anakreon Mentis, Panagiotis Katsaros, Lefteris Ang...
EOR
2010
110views more  EOR 2010»
13 years 10 months ago
Pricing surplus server capacity for mean waiting time sensitive customers
Resources including various assets of supply chains, face random demand over time and can be shared by others. We consider an operational setting where a resource is shared by two...
Sudhir K. Sinha, N. Rangaraj, N. Hemachandra
IJCV
2000
149views more  IJCV 2000»
13 years 9 months ago
Recognition without Correspondence using Multidimensional Receptive Field Histograms
The appearance of an object is composed of local structure. This local structure can be described and characterized by a vector of local features measured by local operators such a...
Bernt Schiele, James L. Crowley
INFOCOM
2007
IEEE
14 years 4 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
STRINGOLOGY
2008
13 years 11 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter